package 力扣._101_对称二叉树;

import 力扣.公用数据结构.TreeNode;

import java.util.*;

public class Solution {

    //判断是否对称
    boolean ishuiwen(List<Integer> list) {
        for (int i = 0, j = list.size() - 1; i < j; i++, j--) {
            if (!Objects.equals(list.get(i), list.get(j)))
                return false;
        }
        return true;
    }

    public boolean isSymmetric(TreeNode root) {
        if (root == null)
            return true;
        //
        Queue<TreeNode> queue = new ArrayDeque<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            TreeNode node = queue.remove();

        }
        return true;
    }

    public static void main(String[] args) {
        List<Integer> list = new ArrayList<>();
        list.add(null);
        System.out.print(list.size());
    }
}
